/*
 *  Copyright 2007-2008 by Matthias Buch-Kromann <mbk.isv@cbs.dk>.
 *  *
 *  This file is part of the Open-source Dependency Toolkit (OSDT),
 *  see http://code.google.com/p/open-source-dependency-toolkit.
 *  
 *  The OSDT is free software: you can redistribute it and/or modify
 *  it under the terms of the GNU Lesser General Public License as 
 *  published by the Free Software Foundation, either version 3 of 
 *  the License, or (at your option) any later version.
 * 
 *  The OSDT is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU Lesser General Public License for more details.
 * 
 *  You should have received a copy of the GNU Lesser General Public 
 *  License along with the OSDT in the files COPYING and COPYING.LESSER.
 *  If not, see http://www.gnu.org/licenses.
 */

package org.osdtsystem.graphs.views;

import java.util.List;
import org.osdtsystem.values.EdgeID;
import org.osdtsystem.values.NodeID;

/**
 *
 * @author Matthias Buch-Kromann <mbk.isv@cbs.dk>
 */
public interface NonProjectiveDependencyTree extends 
        DependencyTree {
    // Takes as its input: dependency tree, landing tree, linear tree (nodes),
    // linear forest (siblings in landing tree)
    
    /**
     * All dependents whose extraction path contains the given dependency edge
     * (the set of extracted nodes for the edge).
     * @param edge the dependency edge
     * @return the list of extracted nodes
     */
    public List<NodeID> extractedNodes(EdgeID edge);
    
    /**
     * All nodes that head a maximal surface tree that is contained strictly 
     * between the two given nodes (maximal surface heads).
     * @param left the left boundary node
     * @param right the right boundary node 
     * @return the list of all maximal surface heads in the given range 
     */
    public List<NodeID> deepBlocksInRange(NodeID left, NodeID right);
    
    /**
     * All edges in the deep tree that span the given node, ie, where the node
     * is situated between the governor and the dependent of the edge.
     * @param node the node
     * @return the list of all edges that span the given node
     */
    public List<EdgeID> deepEdgesAboveNode(NodeID node);
    
    
    /**
     * All edges in the deep tree that cross the given edge. 
     * @param edge
     * @return
     */
    public List<EdgeID> crossings(EdgeID edge);
}
